1

Minkowski Complexity of Sets: An Easy Lower Bound

Year:
2017
Language:
english
File:
PDF, 196 KB
english, 2017
2

Entropy of contact circuits and lower bounds on their complexity

Year:
1988
Language:
english
File:
PDF, 2.02 MB
english, 1988
4

Combinatorics of Monotone Computations

Year:
1999
Language:
english
File:
PDF, 304 KB
english, 1999
5

[Texts in Theoretical Computer Science. An EATCS Series] Extremal Combinatorics ||

Year:
2011
Language:
english
File:
PDF, 4.37 MB
english, 2011
10

On the optimality of Bellman–Ford–Moore shortest path algorithm

Year:
2016
Language:
english
File:
PDF, 342 KB
english, 2016
20

On set intersection representations of graphs

Year:
2009
Language:
english
File:
PDF, 193 KB
english, 2009
22

Laser deposition of YBa2Cu3O7 films in a shadow region

Year:
1995
Language:
english
File:
PDF, 244 KB
english, 1995
26

Very large cliques are easy to detect

Year:
2008
Language:
english
File:
PDF, 144 KB
english, 2008
27

On covering graphs by complete bipartite subgraphs

Year:
2009
Language:
english
File:
PDF, 390 KB
english, 2009
28

Representing (0, 1)-matrices by boolean circuits

Year:
2010
Language:
english
File:
PDF, 328 KB
english, 2010
29

On the minimum number of negations leading to super-polynomial savings

Year:
2004
Language:
english
File:
PDF, 147 KB
english, 2004
30

On the P versus NP intersected with co-NP question in communication complexity

Year:
2005
Language:
english
File:
PDF, 77 KB
english, 2005
31

On convex complexity measures

Year:
2010
Language:
english
File:
PDF, 389 KB
english, 2010
33

Linear codes are hard for oblivious read-once parity branching programs

Year:
1999
Language:
english
File:
PDF, 309 KB
english, 1999
34

MgO by Injection CVD

Year:
1997
Language:
english
File:
PDF, 586 KB
english, 1997
35

Neither reading few bits twice nor reading illegally helps much

Year:
1998
Language:
english
File:
PDF, 1.15 MB
english, 1998
36

On uncertainty versus size in branching programs

Year:
2003
Language:
english
File:
PDF, 174 KB
english, 2003
37

Top-down lower bounds for depth-three circuits

Year:
1995
Language:
english
File:
PDF, 754 KB
english, 1995
38

Some bounds on multiparty communication complexity of pointer jumping

Year:
1998
Language:
english
File:
PDF, 381 KB
english, 1998
39

Entropy of Operators or why Matrix Multiplication is

Year:
2010
Language:
english
File:
PDF, 284 KB
english, 2010
41

A nondeterministic space-time tradeoff for linear codes

Year:
2009
Language:
english
File:
PDF, 136 KB
english, 2009
43

Expanders and time-restricted branching programs

Year:
2008
Language:
english
File:
PDF, 431 KB
english, 2008
44

Electric properties of planar Ag/HgBa2CaCu2O6+δ interface

Year:
1999
Language:
english
File:
PDF, 233 KB
english, 1999
48

On multi-partition communication complexity

Year:
2004
Language:
english
File:
PDF, 344 KB
english, 2004
49

Min-rank conjecture for log-depth circuits

Year:
2011
Language:
english
File:
PDF, 277 KB
english, 2011